5922257

9783540571551

Algorithms and Data Structures

$103.17
$3.95 Shipping
List Price
$109.00
Discount
5% Off
You Save
$5.83

  • Condition: New
  • Provider: LightningBooks Contact
  • Provider Rating:
    85%
  • Ships From: Multiple Locations
  • Shipping: Standard, Expedited (tracking available)
  • Comments: Fast shipping! All orders include delivery confirmation.

seal  

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9783540571551
  • ISBN: 3540571558
  • Publication Date: 1993
  • Publisher: Springer

AUTHOR

Third Workshop on Algorithms and Data Structures Staff, Dehne, Frank, Sack, Jörg-Rüdiger

SUMMARY

The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.Third Workshop on Algorithms and Data Structures Staff is the author of 'Algorithms and Data Structures', published 1993 under ISBN 9783540571551 and ISBN 3540571558.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.